On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows
نویسندگان
چکیده
We investigate the complexity and approximability of the budget-constrained minimum cost flow problem, which is an extension of the traditional minimum cost flow problem by a second kind of costs associated with each edge, whose total value in a feasible flow is constrained by a given budget B. This problem can, e.g., be seen as the application of the ε-constraint method to the bicriteria minimum cost flow problem. We show that we can solve the problem exactly in weakly polynomial time O(logM ·MCF(m,n, C, U)), where C, U , and M are upper bounds on the largest absolute cost, largest capacity, and largest absolute value of any number occuring in the input, respectively, and MCF(m,n, C, U) denotes the complexity of finding a traditional minimum cost flow. Moreover, we present two fully polynomial-time approximation schemes for the problem on general graphs and one with an improved running-time for the problem on acyclic graphs.
منابع مشابه
Manufactured in The Netherlands . Approximation Algorithms for Certain NetworkImprovement
We study budget constrained network upgrading problems. Such problems aim at nding optimal strategies for improving a network under some cost measure subject to certain budget constraints. Given an edge weighted graph G = (V; E), in the edge based upgrading model, it is assumed that each edge e of the given network also has an associated function ce(t) that speciies the cost of upgrading the ed...
متن کاملApproximation Algorithms for Certain NetworkImprovement
We study budget constrained network upgrading problems. Such problems aim at nding optimal strategies for improving a network under some cost measure subject to certain budget constraints. Given an edge weighted graph G = (V; E), in the edge based upgrading model, it is assumed that each edge e of the given network also has an associated function ce(t) that speciies the cost of upgrading the ed...
متن کاملA Fuzzy Random Minimum Cost Network Flow Programming Problem
In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...
متن کاملBudget Constrained Minimum Cost Connected Medians
Several practical instances of network design and location theory problems require the network to satisfy multiple constraints. In this paper, we study a graph-theoretic problem that aims to simultaneously address a network design task and a location-theoretic constraint. The Budget Constrained Connected Median Problem is the following: We are given an undirected graph G = (V;E) with two differ...
متن کاملApproximate Minimum - Cost Multicommodity Flows in ~ O ( " � 2 Knm ) Time
We show that an "-approximate solution of the cost-constrained K-commodity ow problem on an N-nodeM-arc network G can be computed by sequentially solving O K(" 2 + logK) logM log(" 1 K) single-commodity minimum-cost ow problems on the same network. In particular, an approximate minimumcost multicommodity ow can be computed in ~ O(" 2 KNM) running time, where the notation ~ O( ) means \up to log...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 126 شماره
صفحات -
تاریخ انتشار 2017